Editorial Toward Faster Publishing and Shorter Turnaround Time
نویسندگان
چکیده
منابع مشابه
Editorial Boards , Publishing Council
s, Mathematical Reviews, MatSciNet, MatSci on SilverPlatter, Scopus, Zentralblatt Math The issuing of the Informatica journal is financially supported by the Ministry of Higher Education, Science and Technology, Trg OF 13, 1000 Ljubljana, Slovenia. Volume 31 Number 2 June 2007ISSN 0350-5596 IntroductionM. McPherson,P. Isaias139 Intelligent Decision Support for Architecture and<l...
متن کاملImproving theatre turnaround time
The NHS Institute for Innovation and Improvement has determined that a £7 million saving can be achieved per trust by improving theatre efficiency. The aim of this quality improvement project was to improve orthopaedic theatre turnaround without compromising the patient safety. We process mapped all the stages from application of dressing to knife to skin on the next patient in order to identif...
متن کاملWave Scheduler: Scheduling for Faster Turnaround Time in Peer-Based Desktop Grid Systems
The recent success of Internet-based computing projects, coupled with rapid developments in peer-to-peer systems, has stimulated interest in the notion of harvesting idle cycles under a peer-to-peer model. The problem we address in this paper is the development of scheduling strategies to achieve faster turnaround time in an open peer-based desktop grid system. The challenges for this problem a...
متن کاملToward Resolving the Significance Testing Debate : Electronic Publishing and Editorial Decision Making
The debate over the use of statistical significance testing in the social sciences has heated up in recent years. This paper presents a brief review of the common criticisms of significance testing and argues that, as long as journal editors must choose among a number of manuscripts, significance testing provides useful information for making these choices. Electronic publishing is presented as...
متن کاملSimpler, faster and shorter labels for distances in graphs
We consider how to assign labels to any undirected graph with n nodes such that, given the labels of two nodes and no other information regarding the graph, it is possible to determine the distance between the two nodes. The challenge in such a distance labeling scheme is primarily to minimize the maximum label length and secondarily to minimize the time needed to answer distance queries (decod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of the Electron Devices Society
سال: 2018
ISSN: 2168-6734
DOI: 10.1109/jeds.2018.2809398